
public class WordPossCalc {
	//n is the number of letters you want to find the possible permutations of
	
	public int calc(int a){
		if (a ==1) return 1;
		return calc(a-1) * a;
	}
}
